disjoint - определение. Что такое disjoint
Diclib.com
Словарь ChatGPT
Введите слово или словосочетание на любом языке 👆
Язык:

Перевод и анализ слов искусственным интеллектом ChatGPT

На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:

  • как употребляется слово
  • частота употребления
  • используется оно чаще в устной или письменной речи
  • варианты перевода слова
  • примеры употребления (несколько фраз с переводом)
  • этимология

Что (кто) такое disjoint - определение

WIKIMEDIA DISAMBIGUATION PAGE
Disjoint (disambiguation)
Найдено результатов: 717
disjoint         
¦ verb
1. disturb the cohesion or organization of.
2. dated take apart at the joints.
¦ adjective Mathematics (of sets) having no elements in common.
Disjoint         
·vi To fall in pieces.
II. Disjoint ·vt Difficult situation; dilemma; strait.
III. Disjoint ·adj Disjointed; unconnected;
- opposed to conjoint.
IV. Disjoint ·vt To break the natural order and relations of; to make incoherent; as, a disjointed speech.
V. Disjoint ·vt To separate at junctures or joints; to break where parts are united; to break in pieces; as, disjointed columns; to disjoint and edifice.
VI. Disjoint ·vt To separate the joints of; to separate, as parts united by joints; to put out of joint; to force out of its socket; to Dislocate; as, to disjoint limbs; to disjoint bones; to disjoint a fowl in carving.
disjoint         
v. a.
1.
Dislocate, luxate, put out of joint.
2.
Unloose, disconnect, disjoin, separate at the joints or original divisions.
3.
Break up, disarrange, derange, throw into confusion.
disjoint union         
MODIFIED UNION OPERATION THAT INDEXES THE ELEMENTS ACCORDING TO WHICH SET THEY ORIGINATED IN
Disjoint unions; ⨆; ⊔
In domain theory, a union (or sum) which results in a domain without a least element.
Disjoint union         
MODIFIED UNION OPERATION THAT INDEXES THE ELEMENTS ACCORDING TO WHICH SET THEY ORIGINATED IN
Disjoint unions; ⨆; ⊔
and is the set formed from the elements of and labelled (indexed) with the name of the set from which they come. So, an element belonging to both and appears twice in the disjoint union, with two different labels.
Almost disjoint sets         
Almost disjoint; Almost disjoint family
In mathematics, two sets are almost disjoint Kunen, K. (1980), "Set Theory; an introduction to independence proofs", North Holland, p.
Disjoint union (topology)         
SPACE FORMED BY EQUIPPING THE DISJOINT UNION OF THE UNDERLYING SETS WITH A NATURAL TOPOLOGY CALLED THE DISJOINT UNION TOPOLOGY
Topological disjoint sum; Direct sum (topology); Direct sum topology; Disjoint union topology; Topological sum; Coproduct in the category of topological spaces; Free sum; Coproduct topology
In general topology and related areas of mathematics, the disjoint union (also called the direct sum, free union, free sum, topological sum, or coproduct) of a family of topological spaces is a space formed by equipping the disjoint union of the underlying sets with a natural topology called the disjoint union topology. Roughly speaking, in the disjoint union the given spaces are considered as part of a single new space where each looks as it would alone and they are isolated from each other.
Edge disjoint shortest pair algorithm         
  • Graphical Illustration of the Shortest Pair of Disjoint Paths Algorithm
ALGORITHM IN COMPUTER NETWORK ROUTING
Edge Disjoint Shortest Pair Algorithm
Edge disjoint shortest pair algorithm is an algorithm in computer network routing. The algorithm is used for generating the shortest pair of edge disjoint paths between a given pair of vertices.
Maximum disjoint set         
  • right
  • right
  • right
CONCEPT IN COMPUTATIONAL GEOMETRY
Maximum independent set of rectangles; Maximum independent set in the plane
In computational geometry, a maximum disjoint set (MDS) is a largest set of non-overlapping geometric shapes selected from a given set of candidate shapes.
Vertex cycle cover         
Edge disjoint cycle cover; Vertex disjoint cycle cover
In mathematics, a vertex cycle cover (commonly called simply cycle cover) of a graph G is a set of cycles which are subgraphs of G and contain all vertices of G.

Википедия

Disjoint

Disjoint may refer to:

  • Disjoint sets, sets with no common elements
  • Mutual exclusivity, the impossibility of a pair of propositions both being true